Inheritance under Participation Constraints and Disjointness
نویسندگان
چکیده
Traditional database systems have been successful in handling large amounts of data but lack mechanisms for schema derivations and schema veri cation In this paper we propose i structures that carry expressive and useful information on the database schema ii a set of inference rules for schema derivations and iii a mechanism for discovering contradictory schema declarations To this end in addition to the usual Isa relation we de ne a stronger form of spe cialization for properties that we call restriction isa or Risa for short The Risa relation expresses property value re nement A distinctive feature of our model is that it supports the interaction between explicit or derived Isa and Risa relations in di erent contexts We demonstrate that the combination of Isa and Risa provides a powerful conceptual modeling mechanism The Risa relation allows to express participation constraints on properties Speci cally properties of a class are characterized as necessary possible or inapplicable on a given sub class Whether explicitly declared or derived this information is useful for several reasons i It aids the user to understand better the semantics of the subclass ii it uncovers con tradictory declarations or design errors and iii it characterizes property values that are missing from the database Our data model supports property inheritance disjoint classes and negative information expressed in the form of inapplicable properties In particular disjointness in conjuction with Isa and Risa can lead to the derivation of negative information or the detection of contradictory declarations
منابع مشابه
Inheritance under Participation Constraints
Traditional database systems have been successful in handling large amounts of data but lack mechanisms for schema derivations and schema veriication. In this paper, we propose (i) structures that carry expressive and useful information on the database schema, (ii) a set of inference rules for schema derivations, and (iii) a mechanism for discovering contradictory schema declarations. To this e...
متن کاملDeriving Semantic Information through Property Covering and Inheritance
Covering is a well known relationship in semantic and object oriented data models Covering holds when a class is the union of a collection of subclasses However covering has been studied only for entity classes In this paper we investigate covering for properties as well We introduce a new relationship among properties called property covering Property covering holds when a property restricted ...
متن کاملDL-Lite: Practical Reasoning for Rich Dls
In this paper we study a DL rich enough to express UML class diagrams including ISA and disjointness between classes (but not covering constraints), typing of associations, and participation and functional cardinality constraints. For such a DL, which we call DL-Lite, we propose novel reasoning techniques for a variety of tasks, notably including query containment and query answering for conjun...
متن کاملEER-CONCEPTOOL: Conceptual Analysis of EER Schemas and Ontologies
We have developed an intelligent knowledge management environment called EER-ConcepTool, which analyses conceptual schemas and ontologies. In this paper, we show how analysis supports knowledge modelling and validation at the conceptual level through a combination of different logicbased and heuristic reasoning services. We highlight how EER-ConcepTool overcomes some typical drawbacks of curren...
متن کاملTemporal Conceptual Modelling with DL-Lite
Conceptual modelling formalisms such as the Entity-Relationship model (ER) and Unified Modelling Language (UML) have become a de facto standard in database design by providing visual means to describe application domains in a declarative and reusable way. On the other hand, both ER and UML turned out to be closely connected with description logics that are underpinned by formal semantics and th...
متن کامل